Finite fields - PDFSEARCH.IO - Document Search Engine

Finite fields
Results: 995

#	Item
391	Encrypting Proofs on Pairings and Its Application to Anonymity for Signatures Georg Fuchsbauer David Pointcheval Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2008-12-17 12:32:39 Commitment scheme RSA Group signature Homomorphic signatures for network coding Spectral theory of ordinary differential equations Cryptography Finite fields XTR
392	Efficient Implementation of Genus Three Hyperelliptic Curve Cryptography over F2n Izuru Kitamura and Masanobu Katagi Sony Corporation, Kitashinagawa Shinagawa-ku, Tokyo, Japan {Izuru.Kitamura, Masanobu.Ka Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2003-11-28 08:21:17 Group theory Algebraic curves Hyperelliptic curve cryptography Public-key cryptography Hyperelliptic curve Elliptic curve XTR Discrete logarithm RAR Abstract algebra Finite fields Cryptography
393	Two novel applications of bilinear groups to ABE encryption Riccardo Longo Department of Mathematics, University of Trento, Italy Chiara Marcolla Department of Mathema Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2014-12-12 11:38:03 Finite fields Cryptographic protocols Diffie–Hellman problem Pairing-based cryptography Hellman Diffie–Hellman key exchange Discrete logarithm Whitfield Diffie BLS Cryptography Abstract algebra Computational hardness assumptions
394	A Family of Weak Keys in HFE (and the Corresponding Practical Key-Recovery) Charles Bouillaguet1 , Pierre-Alain Fouque1 , Antoine Joux2,3 , and Joana Treger2 1 Ecole Normale Supérieure Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2009-12-15 10:42:41 Polynomials Post-quantum cryptography Computer algebra Finite fields Algebraic geometry Hidden Field Equations Multivariate cryptography Gröbner basis Field extension Abstract algebra Algebra Mathematics
395	Efficient Java Implementation of Elliptic Curve Cryptography for J2ME-Enabled Mobile Devices Johann Großsch¨adl1 , Dan Page2 , and Stefan Tillich2 1 University of Luxembourg, CSC Research Unit, LACS, Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2012-08-28 16:24:04 Computer arithmetic Finite fields Group theory Binary arithmetic Cryptography Elliptic curve cryptography Arbitrary-precision arithmetic Modular arithmetic XTR Abstract algebra Mathematics Arithmetic
396	VLSI Implementation of Double-Base Scalar Multiplication on a Twisted Edwards Curve with an Efficiently Computable Endomorphism Zhe Liu1 , Husen Wang2 , Johann Großsch¨adl1 , Zhi Hu3 , and Ingrid Verbauwhede1 1 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-05-04 12:51:01 Finite fields Group theory Cryptography Twisted Edwards curve Elliptic curve Edwards curve Elliptic Curve DSA Complex multiplication Matrix Abstract algebra Elliptic curves Elliptic curve cryptography
397	On the Implementation of Uniﬁed Arithmetic on Binary Huﬀ Curves Santosh Ghosh1⋆ , Amit Kumar2⋆⋆ , Amitabh Das3 , and Ingrid Verbauwhede3 1 Security and Privacy Research, Intel Labs Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-05-12 13:10:28 Mechanical computers Elliptic curves Elliptic curve cryptography Finite fields Z2 Z3 Z1 Elliptic curve point multiplication Lookup table Abstract algebra History of computing hardware Computing
398	A Simple Provably Secure Key Exchange Scheme Based on the Learning with Errors Problem Jintai Ding, Xiang Xie, Xiaodong Lin University of Cincinnati Chinese Academy of Sciences Rutgers University Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2014-07-29 14:01:16 Electronic commerce Learning with errors Machine learning XTR Normal distribution Diffie–Hellman key exchange Diffie–Hellman problem RSA Cryptography Cryptographic protocols Finite fields
399	AN OBSERVATION ABOUT VARIATIONS OF THE DIFFIE-HELLMAN ASSUMPTION R. BHASKAR, K. CHANDRASEKARAN, S. LOKAM, P.L. MONTGOMERY, R. VENKATESAN, AND Y. YACOBI Abstract. We generalize the Strong Boneh-Boyen (SBB) signature sche Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2008-12-16 15:26:16 Finite fields Computability theory Alan Turing Turing reduction Reduction Diffie–Hellman problem Theoretical computer science Applied mathematics Computational complexity theory
400	Secure Multiparty AES (full paper) Ivan Damg˚ ard and Marcel Keller Dept. of Computer Science, Aarhus University, Denmark {ivan,mkeller}@cs.au.dk Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2009-12-11 11:55:52 Secure multi-party computation Secret sharing Finite fields XTR Cryptography Cryptographic protocols Advanced Encryption Standard

UPDATE